- matrix computation
- 矩阵计算
English-Chinese electricity dictionary (电气专业词典). 2013.
matrix computation
Look at other dictionaries:
Matrix-Kettenmultiplikation — bezeichnet die Multiplikation von mehreren Matrizen. Da die Matrizenmultiplikation assoziativ ist, kann man dabei beliebig klammern. Dadurch wächst die Anzahl der möglichen Berechnungswege exponentiell mit der Länge der Matrizenkette an. Mit der… … Deutsch Wikipedia
Matrix chain multiplication — is an optimization problem that can be solved using dynamic programming. Given a sequence of matrices, we want to find the most efficient way to multiply these matrices together. The problem is not actually to perform the multiplications, but… … Wikipedia
Matrix multiplication — In mathematics, matrix multiplication is a binary operation that takes a pair of matrices, and produces another matrix. If A is an n by m matrix and B is an m by p matrix, the result AB of their multiplication is an n by p matrix defined only if… … Wikipedia
Matrix representation — This article is about the layout of matrices in the memory of computers. For the representation of groups and algebras by matrices in linear algebra, see representation theory. Matrix representation is a method used by a computer language to… … Wikipedia
Matrix determinant lemma — In mathematics, in particular linear algebra, the matrix determinant lemma[1][2] computes the determinant of the sum of an invertible matrix A and the dyadic product, u vT, of a column vector u and a row vector vT. Contents 1 Statemen … Wikipedia
Kernel (matrix) — In linear algebra, the kernel or null space (also nullspace) of a matrix A is the set of all vectors x for which Ax = 0. The kernel of a matrix with n columns is a linear subspace of n dimensional Euclidean space.[1] The dimension… … Wikipedia
Square root of a matrix — In mathematics, the square root of a matrix extends the notion of square root from numbers to matrices. A matrix B is said to be a square root of A if the matrix product B · B is equal to A.[1] Contents 1 Properties 2 Computation methods … Wikipedia
Jordan matrix — In the mathematical discipline of matrix theory, a Jordan block over a ring R (whose identities are the zero 0 and one 1) is a matrix which is composed of 0 elements everywhere except for the diagonal, which is filled with a fixed element… … Wikipedia
Non-negative matrix factorization — NMF redirects here. For the bridge convention, see new minor forcing. Non negative matrix factorization (NMF) is a group of algorithms in multivariate analysis and linear algebra where a matrix, , is factorized into (usually) two matrices, and… … Wikipedia
Eigendecomposition of a matrix — In the mathematical discipline of linear algebra, eigendecomposition or sometimes spectral decomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and… … Wikipedia
Cauchy matrix — In mathematics, a Cauchy matrix is an m imes n matrix A, with elements in the form:a {ij}={frac{1}{x i y j;quad x i y j eq 0,quad 1 le i le m,quad 1 le j le nwhere x i and y j are elements of a field mathcal{F}, and (x i) and (y j) are injective… … Wikipedia
